Deriving a systolic regular language recognizer
نویسندگان
چکیده
We present a derivation of a regular language recognizing circuit originally developed by Foster and Kung [4]. We make use of pointfree relation algebra, in a style combining elements from earlier work in the Eindhoven Mathematics of Program Construction group [0], and from Ruby [6]. First we derive non-systolic recognizers, much in the same way as functional programs are derived. Then we make use of standard circuit transformation techniques, recast in the relation algebra framework, to obtain circuits that are very close to the Diles presented by Foster and Kung.
منابع مشابه
Language of General Fuzzy Recognizer
In this note first by considering the notion of general fuzzy automata (for simplicity GFA), we define the notions of direct product, restricted direct product and join of two GFA. Also, we introduce some operations on (Fuzzy) sets and then prove some related theorems. Finally we construct the general fuzzy recognizers and recognizable sets and give the notion of (trim) reversal of a given GFA....
متن کاملON GENERAL FUZZY RECOGNIZERS
In this paper, we de ne the concepts of general fuzzy recognizer, language recognized by a general fuzzy recognizer, the accessible and the coac- cessible parts of a general fuzzy recognizer and the reversal of a general fuzzy recognizer. Then we obtain the relationships between them and construct a topology and some hypergroups on a general fuzzy recognizer.
متن کاملTwo-Sided Derivatives for Regular Expressions and for Hairpin Expressions
The aim of this paper is to design the polynomial construction of a finite recognizer for hairpin completions of regular languages. This is achieved by considering completions as new expression operators and by applying derivation techniques to the associated extended expressions called hairpin expressions. More precisely, we extend partial derivation of regular expressions to two-sided partial...
متن کاملGeneralized Algorithms for Constructing Statistical Language Models
Recent text and speech processing applications such as speech mining raise new and more general problems related to the construction of language models. We present and describe in detail several new and efficient algorithms to address these more general problems and report experimental results demonstrating their usefulness. We give an algorithm for computing efficiently the expected counts of ...
متن کاملPractical experiments with regular approximation of context-free languages
Several methods are discussed that construct a nite automaton given a context-free grammar, including both methods that lead to subsets and those that lead to supersets of the original context-free language. Some of these methods of regular approximation are new, and some others are presented here in a more re ned form with respect to existing literature. Practical experiments with the di erent...
متن کامل